Hungarian algorithm

Results: 32



#Item
11CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad

CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
12CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad

CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
13CCCG 2010, Winnipeg MB, August 9–11, 2010 Computing Minimum Limited-Capacity Matching in one-Dimensional space and for the Points Lying on Two Perpendicular Lines Fatemeh Panahi∗

CCCG 2010, Winnipeg MB, August 9–11, 2010 Computing Minimum Limited-Capacity Matching in one-Dimensional space and for the Points Lying on Two Perpendicular Lines Fatemeh Panahi∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:19
14Supplemental material Comparison of atom mapping using Hungarian and heuristic algorithm -1-

Supplemental material Comparison of atom mapping using Hungarian and heuristic algorithm -1-

Add to Reading List

Source URL: jcheminf.com

Language: English
    15Swiss Federal Institute of Technology Lausanne, EPFL Master Optional Project Dynamic matching in crowdsourcing

    Swiss Federal Institute of Technology Lausanne, EPFL Master Optional Project Dynamic matching in crowdsourcing

    Add to Reading List

    Source URL: lia.epfl.ch

    Language: English - Date: 2014-07-14 03:36:50
    16Implementation Tricks in the Hungarian Babel Module P´eter Szab´o Department of Analysis Budapest University of Technology and Economics M˝ uegyetem rakpart 3–9.

    Implementation Tricks in the Hungarian Babel Module P´eter Szab´o Department of Analysis Budapest University of Technology and Economics M˝ uegyetem rakpart 3–9.

    Add to Reading List

    Source URL: www.math.bme.hu

    Language: English - Date: 2004-06-30 07:15:31
    17Implementation tricks in the Hungarian babel module Szabó Péter <> September 2004

    Implementation tricks in the Hungarian babel module Szabó Péter <> September 2004

    Add to Reading List

    Source URL: www.math.bme.hu

    Language: English - Date: 2004-08-28 04:22:12
    18Applying Viggo Brun’s Algorithm* to Rhythm [in progress] Kraig Grady 8 June, 2011. All rights reserved I really like this Algorithm shown to me by Erv Wilson. While the application is much more limited in comparison wi

    Applying Viggo Brun’s Algorithm* to Rhythm [in progress] Kraig Grady 8 June, 2011. All rights reserved I really like this Algorithm shown to me by Erv Wilson. While the application is much more limited in comparison wi

    Add to Reading List

    Source URL: www.anaphoria.com

    Language: English - Date: 2011-06-08 19:09:17
    19An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment Problem Justin Colannino Mirela Damian Ferran Hurtado John Iacono

    An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment Problem Justin Colannino Mirela Damian Ferran Hurtado John Iacono

    Add to Reading List

    Source URL: www-cgrl.cs.mcgill.ca

    Language: English - Date: 2006-05-25 15:00:24
    201048 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 31,

    1048 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 31,

    Add to Reading List

    Source URL: tiberiocaetano.com

    Language: English - Date: 2009-04-21 19:59:14